On the Optimal Synthesis of Ring Symmetric Shaped Patterns by Means of Uniformly Spaced Planar Arrays

By taking inspiration from [1], a synthesis strategy is proposed for the case of planar arrays and ring shaped patterns which does not require the exploitation of global optimization procedures. In particular, the approach is able to determine a priori (that is, without solving the overall design problem) whether the given power pattern design constraints can be fulfilled or not, and, in the adfirmative case, to determine the needed excitation coefficients in a fast deterministic manner. Although the approach does not apply to generic planar arrays and generic constraints, it applies to a large number of problems of actual interest, and outperforms some recently published synthesis procedures. Moreover, it may serve both as a reference solution for more general synthesis procedures, and as an elementary brick for more cumbersome synthesis problems.